Proofs , Reasoning and the Metamorphosis of Logic ∗

نویسنده

  • Jean-Baptiste Joinet
چکیده

With the “mathematical watershed”, Logic had been transformed into a foundational theory for mathematics, a theory of truth and proofs far away from its philosophical status of theory of the intellectual process of reasoning. With the recent substitution of the traditional proofs-as-discourses paradigm by the proofsas-programs one, Logic is now becomming a foundational theory for computing. One could interpret this new watershed as being “yet another technological drift”, bringing Logic always closer to practical ingeneering, always further from the human intellectual process of reasoning. This article promote the dual point of view: enlightened by the contemporary analysis of the dynamic of proofs, which bring us to a new understanding of the semantic counterpart of processes operationality (including the links between semantic dereliction due to inconsistency and computational exuberance), Logic has never appeared so close to being, finally, the theory

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-elementary Speed-Ups in Default Reasoning

Default logic is one of the most prominent formalizations of common-sense reasoning. It allows \jumping to conclusions" in case that not all relevant information is known. However, theoretical complexity results imply that default logic is (in the worst case) computationally harder than classical logic. This somehow contradicts our intuition about common-sense reasoning: default rules should he...

متن کامل

ROBUSTNESS OF THE TRIPLE IMPLICATION INFERENCE METHOD BASED ON THE WEIGHTED LOGIC METRIC

This paper focuses on the robustness problem of full implication triple implication inference method for fuzzy reasoning. First of all, based on strong regular implication, the weighted logic metric for measuring distance between two fuzzy sets is proposed. Besides, under this metric, some robustness results of the triple implication method are obtained, which demonstrates that the triple impli...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

On First Order Logic of Proofs

The Logic of Proofs LP solved long standing Gödel’s problem concerning his provability calculus (cf. [4]). It also opened new lines of research in proof theory, modal logic, typed programming languages, knowledge representation, etc. The propositional logic of proofs is decidable and admits a complete axiomatization. In this paper we show that the first order logic of proofs is not recursively ...

متن کامل

New Architectures, Algorithms and Designs That Lead to Implemented Machine Reasoning over Knowledge in Epistemic and Deontic Formats, in the Service of Advanced Wargaming

We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then use Athena as a metalanguage in order to reason about the multi-agent logic an as object language. This facilitates theorem proving in the multi-agent logic in several ways. First, it lets us marshal the highly efficient theore...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010